Signed Tilings with Squares
نویسندگان
چکیده
منابع مشابه
Signed shape tilings of squares
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the sa...
متن کامل99 9 Signed Shape Tilings of Squares ∗
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the sa...
متن کاملSigned Lozenge Tilings
It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more general than hexagons. They are obtained by further removing upward-pointing triangles. We call the resulting shapes triangular regions. We establish signed v...
متن کاملEnumerating Tilings of Rectangles by Squares with Recurrence Relations
Counting the number of ways to tile an m × n rectangle with squares of various sizes is a traditional combinatorial problem. In this paper, we demonstrate a simple method for constructing the recurrence relations satisfied by the solutions to these problems. This method also generalizes to similar problems that have not been previously considered, including three dimensional “tilings”. We are a...
متن کاملExcitation Conditions for Signed Regressor Least Mean Squares Adaptation
The stability of the signed regressor variant of least mean square (LMS) adaptation is found to be heavily dependent on the characteristics of the input sequence. Averaging theory is used to derive a persistence of excitation condition which guarantees exponential stability of the signed regressor algorithm. Failure to meet this condition (which is not equivalent to persistent excitation for LM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1999
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2902